A new class of graceful graphs: k-enriched fan graphs and their characterisations
نویسندگان
چکیده
The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of best known open problems Graph Theory. conjecture has caused a great interest study gracefulness simple graphs and led to many new contributions list graceful graphs. However, it acknowledged not much about structure after 55 years.
منابع مشابه
Super-edge-graceful labelings of multi-level wheel graphs, fan graphs and actinia graphs
graceful labeling of G. Such sets P and Q are called the vertex values set and edge labels set of G, respectively. The notions of super-edge-graceful graphs and edge-graceful graphs are different. Mitchem and Simoson [6] showed that the step graph C2 6 is super-edge-graceful but not edge-graceful. Shiu [7] showed that the complete graph K4 is edge-graceful but not super-edge-graceful. Mitchem a...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملGraceful Signed Graphs on C k 3
In [4], we have proved the necessary condition for sigraphs on union of k copies cycles of length three with one vertex in common denoted by C 3 to be graceful and sufficiency part of the theorem was discussed in certain special cases when all rim edges are negative and form a maximum matching. In this paper, we discuss the sufficiency part of the theorem on gracefulness of sigraphs on C 3 part...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cubo
سال: 2021
ISSN: ['0716-7776', '0719-0646']
DOI: https://doi.org/10.4067/s0719-06462021000200313